A Pan-Sharpening Method with Beta-Divergence Non-Negative Matrix Factorization in Non-Subsampled Shear Transform Domain

نویسندگان

چکیده

In order to combine the spectral information of multispectral (MS) image and spatial panchromatic (PAN) image, a pan-sharpening method based on ?-divergence Non-negative Matrix Factorization (NMF) in Non-Subsampled Shearlet Transform (NSST) domain is proposed. Firstly, we improve traditional contrast calculation build weighted local measure (WLCM) method. Each band MS fused by WLCM-based adaptive averaging rule obtain intensity component I. Secondly, an matting model introduced retain image. I used as initial ? channel estimate foreground color F background B. Depending NSST, PAN are decomposed into one low-frequency several high-frequency components, respectively. Fusion rules designed corresponding characteristics components. A NMF Alternating Direction Method Multipliers (ADMM) fuse low frequency The components inverted NSST inverse transformation, obtained final channel. Finally, reconstructed according F, B, experimental results demonstrate that proposed achieves superior performance both subjective visual effects objective evaluation, effectively preserves while improving resolution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new approach for building recommender system using non negative matrix factorization method

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

متن کامل

Sparse Non-negative Matrix Factorization with Generalized Kullback-Leibler Divergence

Non-negative Matrix Factorization (NMF), especially with sparseness constraints, plays a critically important role in data engineering and machine learning. Hoyer (2004) presented an algorithm to compute NMF with exact sparseness constraints. The exact sparseness constraints depends on a projection operator. In the present work, we first give a very simple counterexample, for which the projecti...

متن کامل

Real-time Polyphonic Music Transcription with Non-negative Matrix Factorization and Beta-divergence

In this paper, we investigate the problem of real-time polyphonic music transcription by employing non-negative matrix factorization techniques and the β-divergence as a cost function. We consider real-world setups where the music signal arrives incrementally to the system and is transcribed as it unfolds in time. The proposed transcription system is addressed with a modified non-negative matri...

متن کامل

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2022

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs14122921